Online kernel nonnegative matrix factorization
نویسندگان
چکیده
منابع مشابه
Online kernel nonnegative matrix factorization
Nonnegative matrix factorization (NMF) has become a prominent signal processing and data analysis technique. To address streaming data, online methods for NMF have been introduced recently, mainly restricted to the linear model. In this paper, we propose a framework for online nonlinear NMF, where the factorization is conducted in a kernel-induced feature space. By exploring recent advances in ...
متن کاملOnline Kernel Matrix Factorization
The problem of efficiently applying a kernel-induced feature space factorization to a largescale data sets is addressed in this thesis. Kernel matrix factorization methods have showed good performances solving machine learning and data analysis problems. However, the present growth of the amount of information available implies the problems can not be solved with conventional methods, due their...
متن کاملOnline Nonnegative Matrix Factorization with General Divergences
We develop a unified and systematic framework for performing online nonnegative matrix factorization under a wide variety of important divergences. The online nature of our algorithm makes it particularly amenable to large-scale data. We prove that the sequence of learned dictionaries converges almost surely to the set of critical points of the expected loss function. We do so by leveraging the...
متن کاملAn Efficient Nonnegative Matrix Factorization Approach in Flexible Kernel Space
In this paper, we propose a general formulation for kernel nonnegative matrix factorization with flexible kernels. Specifically, we propose the Gaussian nonnegative matrix factorization (GNMF) algorithm by using the Gaussian kernel in the framework. Different from a recently developed polynomial NMF (PNMF), GNMF finds basis vectors in the kernel-induced feature space and the computational cost ...
متن کاملKernel nonnegative matrix factorization for spectral EEG feature extraction
Nonnegative matrix factorization (NMF) seeks a decomposition of a nonnegative matrix XX0 into a product of two nonnegative factor matrices UX0 and VX0, such that a discrepancy between X and UV> is minimized. Assuming U 1⁄4 XW in the decomposition (for WX0), kernel NMF (KNMF) is easily derived in the framework of least squares optimization. In this paper we make use of KNMF to extract data, whic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Signal Processing
سال: 2017
ISSN: 0165-1684
DOI: 10.1016/j.sigpro.2016.08.011